Bit Parallel String Matching Algorithms: A Survey
نویسندگان
چکیده
منابع مشابه
Alternative Algorithms for Bit-Parallel String Matching
We consider bit-parallel algorithms of Boyer-Moore type for exact string matching. We introduce a two-way modification of the BNDM algorithm. If the text character aligned with the end of the pattern is a mismatch, we continue by examining text characters after the alignment. Besides this two-way variation, we present a simplified version of BNDM without prefix search and an algorithm scheme fo...
متن کاملBit-Parallel Approximate String Matching Algorithms with Transposition
Using bit-parallelism has resulted in fast and practical algorithms for approximate string matching under the Levenshtein edit distance, which permits a single edit operation to insert, delete or substitute a character. Depending on the parameters of the search, currently the fastest non-filtering algorithms in practice are the O(kn!m/w") algorithm of Wu & Manber, the O(!km/w"n) algorithm of Ba...
متن کاملEfficient bit-parallel multi-patterns approximate string matching algorithms
Multi-patterns approximate string matching (MASM) problem is to find all the occurrences of set of patterns P0, P1, P2...Pr-1, r≥1, in the given text T[0...n-1], allowing limited number of errors in the matches. This problem has many applications in computational biology viz. finding DNA subsequences after possible mutations, locating positions of a disease(s) in a genome etc. The MASM problem ...
متن کاملParallel String Matching Algorithms
String-matching cannot be done by a two-head one-way deterministic nite automaton, Information Processing Letters 22, 231-235.
متن کاملFaster Bit-Parallel Approximate String Matching
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The rst one Myers, J. of the ACM, 1999], searches for a pattern of length m in a text of length n permitting k diierences in O(mn=w) time, where w is the width of the computer word. The second one Navarro and Raanot, ACM JEA, 2000], extends a sublinear-time exact algorithm to approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2014
ISSN: 0975-8887
DOI: 10.5120/16632-6501